Saturation numbers for Ramsey-minimal graphs
نویسندگان
چکیده
منابع مشابه
Saturation numbers for families of Ramsey-minimal graphs
Given a family of graphs F , a graph G is F-saturated if no element of F is a subgraph of G, but for any edge e in G, some element of F is a subgraph of G + e. Let sat(n,F) denote the minimum number of edges in an F -saturated graph of order n. For graphs G,H1, . . . , Hk, we write that G → (H1, . . . , Hk) if every k-coloring of E(G) contains a monochromatic copy of Hi in color i for some i. A...
متن کاملRamsey-minimal saturation numbers for matchings
Given a family of graphs F , a graph G is F-saturated if no element of F is a subgraph of G, but for any edge e in G, some element of F is a subgraph of G + e. Let sat(n,F) denote the minimum number of edges in an F-saturated graph of order n, which we refer to as the saturation number or saturation function of F . If F = {F}, then we instead say that G is F -saturated and write sat(n, F ). For...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملRamsey-minimal graphs for forests
It is shown in this paper that the pair (G, H) is Ramsey infinite when both G and H are forests, with at least one of G or H having a non-star component. In addition, an infinite subfamily of R(PP.) is constructed .
متن کاملMinimal Ordered Ramsey Graphs
An ordered graph is a graph equipped with a linear ordering of its vertex set. A pair of ordered graphs is Ramsey finite if it has only finitely many minimal ordered Ramsey graphs and Ramsey infinite otherwise. Here an ordered graph F is an ordered Ramsey graph of a pair (H,H ′) of ordered graphs if for any coloring of the edges of F in colors red and blue there is either a copy of H with all e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2018
ISSN: 0012-365X
DOI: 10.1016/j.disc.2018.08.012